ON THE COSET PATTERN MATRICES AND MINIMUM M-ABERRATION OF 2n−p DESIGNS
نویسندگان
چکیده
The coset pattern matrix (CPM) is formally defined as an elaborate characterization of the aliasing patterns of a fractional factorial design. The possibility of using CPM to check design isomorphism is investigated. Despite containing much information about effect aliasing, the CPM fails to determine a design uniquely. We report and discuss small nonisomorphic designs that have equivalent coset pattern matrices. These examples imply that the aliasing property and the combinatorial structure of a design depend on each other in a complex manner. Based on CPM, a new optimality criterion called the minimum M -aberration criterion is proposed to rank-order designs. Its connections with other existing optimality criteria are discussed.
منابع مشابه
An Algorithm for Sequentially Constructing Non-Isomorphic Orthogonal Designs and its Applications
We propose an algorithm for sequentially constructing non-isomorphic orthogonal designs (including both regular and non-regular orthogonal designs). An essential element of the algorithm is using minimal column base to reduce the computations for determining isomorphism between any two designs. By using this algorithm, we obtain the complete catalogs of n k (k = 2; : : : ; n 1) two-level orthog...
متن کامل(0, 1)-Matrices with No Half-Half Submatrix of Ones
We consider the minimum number of zeroes in a 2m 2n (0; 1)-matrix M that contains no m n submatrix of ones. We show that this number, denoted by f(m; n), is at least 2n + m + 1 for m n. We determine exactly when this bound is sharp and determine the extremal matrices in these cases. For any m, the bound is sharp for n = m and for all but nitely many n > m. A general upper bound due to Gentry, f...
متن کاملMinimum ranks of sign patterns via sign vectors and duality
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A. It is shown in this paper that for any m×n sign pattern A with minimum rank n− 2, rational realization of the minimum rank is possible. This is done using a new ap...
متن کاملBases of Minimum-Weight Vectors for Codes from Designs
An explicit basis of incidence vectors for the p-ary code of the design of points and hyperplanes of the affine geometry AGm(Fp) for any prime p and any integer m ≥ 2 is obtained, which, as a corollary, gives a new elementary proof that this code is a generalized Reed-Muller code. In the proof a class of non-singular matrices related to Vandermonde matrices is introduced.
متن کاملThe Complexity of the AlgebraicEigenproblem
The eigenproblem for an n-by-n matrix A is the problem of the approximation (within a relative error bound 2 ?b) of all the eigenvalues of the matrix A and computing the associated eigenspaces of all these eigenvalues. We show that the arithmetic complexity of this problem is bounded by O(n 3 + (n log 2 n) log b). If the characteristic and minimum polynomials of the matrix A coincide with each ...
متن کامل